Security of NIDV Proof Systems for Certificate-Free Undeniable Signature Schemes
نویسندگان
چکیده
Undeniable signature schemes are not publicly verifiable. Therefore, in order to prove the validity/invalidity of a message-signature pair, the signer needs to provide a proof for the rightful verifier. Since the introduction of undeniable signature schemes, various proof systems with different properties and features have been introduced to be incorporated in the structure of such schemes. Among all, the noninteractive designated verifier proof generation system of Jakobsson et al. with its distinguishing properties and features has been recognized as the most practical proof system. Due to its interesting features, a variation of Jakobsson et al. proof system has been employed in all of the proposed identity-based and certificateless undeniable signature schemes. In this paper, we analyze the security of the variation of such proof system in identity-based settings and present a secure identity-based non-interactive proof system with complete set of security proofs.
منابع مشابه
Non-interactive Designated Verifier Proofs and Undeniable Signatures
Non-interactive designated verifier (NIDV) proofs were first introduced by Jakobsson et al. and have widely been used as confirmation and denial proofs for undeniable signature schemes. There appears to be no formal security modelling for NIDV undeniable signatures or for NIDV proofs in general. Indeed, recent work by Wang has shown the original NIDV undeniable signature scheme of Jakobsson et ...
متن کاملCertificateless undeniable signature scheme q
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based cryptosystems. Also it can avoid the onerous management of certificates. Particularly, by using some cryptographic and mathematical techniques, we guarantee that the scheme’s two component protocols satisfy the properties of...
متن کاملCryptographically Strong Undeniable Signatures , Unconditionally Secure for the Signer ( Extended Abstract )
We present the first undeniable signature schemes where signers are unconditionally secure. In the efficient variants, the security for the recipients relies on a discrete logarithm assumption or on factoring; and in a theoretical version, on claw-free permutation pairs. Besides, on the one hand, the efficient variants are the first practical cryptographically strong undeniable signature scheme...
متن کاملDevelopment of Undeniable Signature Schemes without Certificates
The notion of undeniable signature schemes was proposed by Chaum and Antwerpen in order to provide the signer with the ability to control the privacy of her signatures. Undeniable signature schemes without certificates that have been proposed to this day are either in identity-based paradigm or certificateless paradigm. In this paper, we provide a complete review on the development course of un...
متن کاملSpecial Signature Schemes and Key Agreement Protocols
This thesis is divided into two distinct parts. The first part of the thesis explores various deniable signature schemes and their applications. Such schemes do not bind a unique public key to a message, but rather specify a set of entities that could have created the signature, so each entity involved in the signature can deny having generated it. The main deniable signature schemes we examine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013